A FOCUSS-Based Algorithm for Nonlinear Overcomplete Independent Component Analysis

نویسنده

  • C. WEI
چکیده

A new neural network approach is proposed to solve the blind signal separation problem under both nonlinear and overcomplete conditions. To our knowledge, most previous algorithms including FOCal Underdetermined System Solver (FOCUSS) focus on linear distortion which may not accord with practical applications. We base our work on the FOCUSS algorithm but develop it further to apply for nonlinear situations. The corresponding parameter learning algorithm for the proposed neural network is also presented through formal derivation. Simulation has been carried out to show that the proposed method can separate the independent sparse signals successfully under nonlinear and overcomplete conditions. Key-Words: FOCUSS, Nonlinear Independent Component Analysis (ICA), Neural Network, Blind Signal Separation, Bayesian Framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Sparse Overcomplete Codes for Images

Images can be coded accurately using a sparse set of vectors from a learned overcomplete dictionary, with potential applications in image compression and feature selection for pattern recognition. We present a survey of algorithms that perform dictionary learning and sparse coding and make three contributions. First, we compare our overcomplete dictionary learning algorithm (FOCUSS-CNDL) with o...

متن کامل

Learning Nonlinear Overcomplete Representations for Eecient Coding

We derive a learning algorithm for inferring an overcomplete basis by viewing it as probabilistic model of the observed data. Over-complete bases allow for better approximation of the underlying statistical density. Using a Laplacian prior on the basis coeecients removes redundancy and leads to representations that are sparse and are a nonlinear function of the data. This can be viewed as a gen...

متن کامل

A Null-space Algorithm for Overcomplete Independent Component Analysis

Independent component analysis (ICA) is an important method for blind source separation and unsupervised learning. Recently, the method has been extended to overcomplete situation where the number of sources is greater than the number of receivers. Comparing complete ICA and overcomplete ICA in existing literature, one can notice that complete ICA does not assume noise in observations, and the ...

متن کامل

Two Methods for Estimating Overcomplete Independent Component Bases

Estimating overcomplete ICA bases is a difficult problem that emerges when using ICA on many kinds of natural data, e.g. image data. Most algorithms are based on approximations of the likelihood, which leads to computationally heavy procedures. Here we introduce two algorithms that are based on heuristic approximations and estimate an approximate overcomplete basis quite fast. The algorithms ar...

متن کامل

Learning Nonlinear Overcomplete Representations for Efficient Coding

We derive a learning algorithm for inferring an overcomplete basis by viewing it as probabilistic model of the observed data. Overcomplete bases allow for better approximation of the underlying statistical density. Using a Laplacian prior on the basis coefficients removes redundancy and leads to representations that are sparse and are a nonlinear function of the data. This can be viewed as a ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004